Limits of random walks with distributionally robust transition probabilities
نویسندگان
چکیده
We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within neighborhood (w.r.t. Wasserstein distance) of the fixed Lévy process. In analogy classical framework we show that, when passing from discrete continuous via scaling limit, this gives rise semigroup. explicitly compute generator semigroup and corresponding PDE as perturbation initial
منابع مشابه
Survival probabilities of weighted random walks
Abstract. We study the asymptotic behaviour of the probability that a weighted sum of centered i.i.d. random variables Xk does not exceed a constant barrier. For regular random walks, the results follow easily from classical fluctuation theory, while this theory does not carry over to weighted random walks, where essentially nothing seems to be known. First we discuss the case of a polynomial w...
متن کاملPath probabilities of continuous time random walks
Employing the path integral formulation of a broad class of anomalous diffusion processes, we derive the exact relations for the path probability densities of these processes. In particular, we obtain a closed analytical solution for the path probability distribution of a Continuous Time Random Walk (CTRW) process. This solution is given in terms of its waiting time distribution and short time ...
متن کاملDistributionally Robust Stochastic Programming with Binary Random Variables
In this paper, we consider stochastic programming with binary random variables, that is, when the random variable represents random subsets of a set. We consider a distributionally robust model, where the only knowledge about the distribution is the marginal probability of each element to appear in the random set. The objective is to minimize expected cost under the worst case distribution with...
متن کاملSurvival probabilities in time-dependent random walks.
We analyze the dynamics of random walks in which the jumping probabilities are periodic time-dependent functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary. The typical lifetime of the walkers is found to decrease with an increment in the oscillation amplitude of the jumping probabilities. We discuss the applicability of...
متن کاملRobust Named Entity Disambiguation with Random Walks
Named Entity Disambiguation is the task of assigning entities from a Knowledge Graph (KG) to mentions of such entities in a textual document. The state-of-the-art for this task balances two disparate sources of similarity: lexical, defined as the pairwise similarity between mentions in the text and names of entities in the KG; and semantic, defined through some graph-theoretic property of a sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2021
ISSN: ['1083-589X']
DOI: https://doi.org/10.1214/21-ecp393